Publications of
Myriam Bounhas, Khaled Mellouli, Henri Prade, Mathieu Serrurier
Possibilistic classifiers for numerical data
In : Soft Computing, Springer-Verlag, Heidelberg, Allemagne, Vol. 17 N. 5, pp. 733-751, 2013.
Nahla Ben Amor, Khaled Mellouli, Salem Benferhat, Didier Dubois, Henri Prade
A theoretical framework for possibilistic independence in a weakly ordered setting
In : International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, World Scientific Publishing Company, Vol. 10 N. 2, pp. 117-155, April 2002.
Myriam Bounhas, Henri Prade, Mathieu Serrurier, Khaled Mellouli
A Possibilistic Rule-Based Classifier (regular paper)
In : Advanced Methods in Artificial Intelligence (IPMU 2012), Catania, Italy, 09/07/12-13/07/12, Springer, pp. 21-31, 2012.
Myriam Bounhas, Henri Prade, Mathieu Serrurier, Khaled Mellouli
Possibilistic Classifiers for Uncertain Numerical Data (regular paper)
In : European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2011), Belfast, 29/06/11-01/07/11, Vol. LNAI 6717, Weiru Liu (Eds.), Springer, pp. 434-446, 2011.
Abstract URL : http://www.informatik.uni-trier.de/~ley/db/conf/ecsqaru/ecsqaru2011.html
BibTeXMyriam Bounhas, Khaled Mellouli, Henri Prade, Mathieu Serrurier
FromBayesian classifiers to possibilistic classifiers for numerical data (regular paper)
In : International Conference on Scalable Uncertainty Management (SUM 2010), Toulouse, France, 27/09/10-29/09/10, Amol Deshpande, Anthony Hunter (Eds.), Springer, LNAI 6379, pp. 112-125, 2010.
Nahla Ben Amor, Salem Benferhat, Khaled Mellouli
Anytime possibilistic propagation algorithm
In : Proc. of the first International Conference, Soft-Ware 2002: Computing in an Imperfect World, Belfast, Northern Ireland, 08/04/02-10/04/02, Springer-Verlag, LNCS 2311, pp. 263-279, April 2002.
Nahla Ben Amor, Salem Benferhat, Khaled Mellouli
Un algorithme de propagation pour les réseaux possibilistes basés sur le conditionnement ordinal
In : 13ème Congrès Francophone AFRIF-AFIA de Reconnaissance des Formes et d’Intelligence Artificielle (RFIA 2002), Angers-France, 08/01/02-10/01/02, Le Comité d’Organisation, pp. 339-348, January 2002.
Nahla Ben Amor, Salem Benferhat, Khaled Mellouli
A two-steps algorithm for min-based possibilistic causal networks
In : Proc.of the 6th.European Conference (ECSQARU 2001), Toulouse, France, 19/09/01-21/09/01, Springer-Verlag, pp. 266-277, September 2001.
Nahla Ben Amor, Salem Benferhat, Khaled Mellouli
Some issues on the coherence of min-based possibilistic causal Networks
In : Proc.Joint 9th IFSA World Congress and 20th NAFIPS International Conference, Vancouver-Canada, 25/07/01-28/07/01, IEEE Operations Center, pp. 604-609, July 2001.
Nahla Ben Amor, Salem Benferhat, Khaled Mellouli
Possibilistic Independence vs Qualitative Independence
In : IMPU’2000, Madrid, 03/07/00-07/07/00, Graficas 82 S.L., Madrid, pp. 349-356, July 2000.
Nahla Ben Amor, Salem Benferhat, Khaled Mellouli
Qualitative possibilistic independence based on plausibility relations
In : Technologies for Constructing Intelligent Systems 2. Bernadette Bouchon-Meunier, Julio Gutiérrez-Rios, Luis Magdalena, Ronald R. Yager (Eds.) , Janusz Kacprzyk, Warsaw, Poland, pp. 31-44, Vol. 90, Studies in Fuzziness and Soft Computing, 2002.